Semantic Visualization with Neighborhood Graph Regularization

نویسندگان

  • Tuan M. V. Le
  • Hady Wirawan Lauw
چکیده

Visualization of high-dimensional data, such as text documents, is useful to map out the similarities among various data points. In the high-dimensional space, documents are commonly represented as bags of words, with dimensionality equal to the vocabulary size. Classical approaches to document visualization directly reduce this into visualizable two or three dimensions. Recent approaches consider an intermediate representation in topic space, between word space and visualization space, which preserves the semantics by topic modeling. While aiming for a good fit between the model parameters and the observed data, previous approaches have not considered the local consistency among data instances. We consider the problem of semantic visualization by jointly modeling topics and visualization on the intrinsic document manifold, modeled using a neighborhood graph. Each document has both a topic distribution and visualization coordinate. Specifically, we propose an unsupervised probabilistic model, called Semafore, which aims to preserve the manifold in the lower-dimensional spaces through a neighborhood regularization framework designed for the semantic visualization task. To validate the efficacy of Semafore, our comprehensive experiments on a number of real-life text datasets of news articles and Web pages show that the proposed methods outperform the state-of-the-art baselines on objective evaluation metrics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scalable Visualization of Semantic Nets using Power-Law Graphs

Scalability and performance implications of semantic net visualization techniques are open research challenges. This paper focuses on developing a visualization technique that mitigates these challenges. We present a novel approach that exploits the underlying concept of power-law degree distribution as many realistic semantic nets seems to possess a power law degree distribution and present a ...

متن کامل

Common Neighborhood Graph

Let G be a simple graph with vertex set {v1, v2, … , vn}. The common neighborhood graph of G, denoted by con(G), is a graph with vertex set {v1, v2, … , vn}, in which two vertices are adjacent if and only if they have at least one common neighbor in the graph G. In this paper, we compute the common neighborhood of some composite graphs. In continue, we investigate the relation between hamiltoni...

متن کامل

Characteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs

Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...

متن کامل

Generating an Indoor space routing graph using semantic-geometric method

The development of indoor Location-Based Services faces various challenges that one of which is the method of generating indoor routing graph. Due to the weaknesses of purely geometric methods for generating indoor routing graphs, a semantic-geometric method is proposed to cover the existing gaps in combining the semantic and geometric methods in this study. The proposed method uses the CityGML...

متن کامل

Regularized Neighborhood Component Analysis

Discriminative feature extraction is one of the fundamental problems in pattern recognition and signal processing. It was recently proposed that maximizing the class prediction by neighboring samples in the transformed space is an effective objective for learning a lowdimensional linear embedding of labeled data. The associated methods, Neighborhood Component Analysis (NCA) and Relevant Compone...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Artif. Intell. Res.

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2016